Supplement of “ Improvement of Real - Time Multi - Core Schedulability with Forced Non - Preemption ”

نویسندگان

  • Jinkyu Lee
  • Kang G. Shin
چکیده

The technique in [4] uses the notion of interference [27]. The interference to τk in an interval of [a, b) (denoted by Ik(a, b)) represents the cumulative length of all intervals in [a, b) such that a job of τk is ready to execute but cannot be executed due to the execution of other ready jobs. Also, the interference of a task τi to another task τk in an interval of [a, b) (denoted by Ik←i(a, b)) represents the cumulative length of all intervals in [a, b) such that a job of τi executes but a job of τk cannot, although it is ready for execution. Since a job of τk does not execute in a given time slot only when m other jobs execute, the following equation holds under any global workconserving algorithm [27]:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times

In this paper, we study schedulability analysis problems for multi-processor real-time systems. Assume a set of real time tasks whose execution times and deadlines are known. We use timed automata to describe the non-deterministic arrival times of tasks. The schedulability problem is to check whether the released task instances can be executed within their given deadlines on a multi-processor p...

متن کامل

A Response-Time Analysis for Non-preemptive Job Sets under Global Scheduling

An effective way to increase the timing predictability of multicore platforms is to use non-preemptive scheduling. It reduces preemption and job migration overheads, avoids intra-core cache interference, and improves the accuracy of the worst-case execution time (WCET) estimation. However, existing schedulability tests for global non-preemptive multiprocessor scheduling are often too pessimisti...

متن کامل

Limited carry-in technique for real-time multi-core scheduling

Schedulability analysis has been widely studied to provide offline timing guarantees for a set of real-time tasks. The so-called limited carry-in technique, which can be orthogonally incorporated into many different multi-core schedulability analysis methods, was originally introduced for Earliest Deadline First (EDF) scheduling to derive a tighter bound on the amount of interference of carry-i...

متن کامل

Sustainable Multiprocessor Real-Time Scheduling with Exact Preemption Cost

In this paper, we address for safety critical applications the problem of multiprocessor real-time scheduling while taking into account the exact preemption cost. In the framework of multiprocessor real-time partitioned scheduling, we propose a greedy heuristic which balances the load of the tasks on all the processors and minimizes the response time of the applications. That heuristic uses a s...

متن کامل

Schedulability analysis for the abort-and-restart model

In real-time systems, a schedulable task-set guarantees that all tasks complete before their deadlines. In functional programming, atomic execution provides the correctness of the program. Priority-based functional reactive programming (P-FRP) allows the usage of functional programming in the real-time system environment. The abort-and-restart (AR) is a scheme to implement P-FRP but an appropri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012